A Numerical Algorithm for Zero Counting. III: Randomization and Condition
نویسندگان
چکیده
In a recent paper [7] we analyzed a numerical algorithm for computing the number of real zeros of a polynomial system. The analysis relied on a condition number κ(f) for the input system f . In this paper we look at κ(f) as a random variable derived from imposing a probability measure on the space of polynomial systems and give bounds for both the tail P{κ(f) > a} and the expected value E(log κ(f)).
منابع مشابه
A Numerical Algorithm for Zero Counting. II: Randomization and Condition
In a recent paper [9] we analyzed a numerical algorithm for computing the number of real zeros of a polynomial system. The analysis relied on a condition number κ(f) for the input system f . In this paper we continue this analysis by looking at κ(f) as a random variable derived from imposing a probability measure on the space of polynomial systems. We give bounds for both the tail P{κ(f) > a} a...
متن کاملA Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis
We show a Condition Number Theorem for the condition number of zero counting for real polynomial systems. That is, we show that this condition number equals the inverse of the normalized distance to the set of ill-posed systems (i.e., those having multiple real zeros). As a consequence, a smoothed analysis of this condition number follows.
متن کاملPseudofractals and box counting algorithm
We show that for sets with the Hausdorff–Besicovitch dimension equal zero the box counting algorithm commonly used to calculate Renyi exponents (dq) can exhibit perfect scaling suggesting non zero dq’s. Properties of these pathological sets (pseudofractals) are investigated. Numerical, as well as analytical estimates for dq’s are obtained. A simple indicator is given to distinguish pseudofracta...
متن کاملA Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators
In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...
متن کاملA Numerical Algorithm for Zero Counting. I: Complexity and Accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f . The algorithm performs O(log(nDκ(f))) iterations (grid refinements) where n is the number of polynomials (as well as the dimension of the ambient space), D is a bound on the polynomials’ degree, and κ(f) is a condition number for the system. Each iteration uses an exponential number of operat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1007.1597 شماره
صفحات -
تاریخ انتشار 2010